Location:
Search - structure tree
Search list
Description: 清华大学数据结构课上实现的B+树，设计一个4阶B+树，包括： (1) 叶子的每个记录应该包括4字节（long）关键码值和60字节的数据字段(存储文件名等，可以自定)，设每个叶子可以存储5条记录，而内部节点应该是关键码值/指针对。此外，每个节点还应该有指向同层下一个节点的指针、本节点存储的关键码数等； (2) 此4阶B+树应该支持插入、删除以及根据给定关键码值进行精确检索与关键码范围检索； (3) 显示（打印）此4阶B+树的生长(含删除节点)过程实例；-Tsinghua University class data structure to achieve the B-tree, the design of a B-tree four bands, including : (a) the leaves of each record should include 4-byte (long) key code value and 60 gigabytes of data fields (document storage, etc., can be set), set up each leaf store five records, and internal nodes is the key code value/means against. In addition, each node should have the same point under a layer of the target node, the node storage key code number; (2) The B-tree four bands should support the insertion, deletion and with the given key code value accurate retrieval and key codes scope retrieval; (3) Display (Print ) This four bands B-tree growth (including the deletion of nodes) process examples;
Platform: |
Size: 3072 |
Author: qqiang |
Hits:
Description: 空间数据库中空间数据结构的应用，K-d树基本操作的源码，都在这个文档中。-spatial database structure of the data space applications, K-d trees basic operation of the source code in the documents.
Platform: |
Size: 6144 |
Author: 周琳 |
Hits:
Description: It s a note about data structure. Tree---self balancing and rotate-It's a note about data structure. Tree--- se lf balancing and rotate
Platform: |
Size: 79872 |
Author: Benny Van |
Hits:
Description: 用 java实现的 搜索二叉树的插入、删除、遍历和平衡，是自己用与数据结构考试编写的 ，对数的相关编程很有用-java with the realization of the binary tree search, insert, delete, and traverse balance, and the use of their own data structure prepared by the examination of a number of useful programming
Platform: |
Size: 2048 |
Author: 记忆超 |
Hits:
Description: 数据结构
1、算法思路：
在此二叉树操作中，主要采用链式存储结构，由于遍历二叉树基本操作是访问结点，则不论按哪一种次序进行遍历，对含有n个结点的二叉树，其时间复杂度均为O(n)；空间复杂度为二叉树的高度。
-Data Structure 1, Algorithm idea: In this binary tree operation, mainly the structure of chain stores, due to the basic operation is a binary tree traversal to visit nodes, regardless of by what kind of order traversal, containing n- node of the tree, its time complexity are O (n) space complexity for the tree height.
Platform: |
Size: 29696 |
Author: Anson |
Hits:
Description: 数据结构
1、算法思路：
哈夫曼树算法：a）根据给定的n个权值{W1，W2… ，Wn }构成 n棵二叉树的集合F={T1，T2…，T n }，其中每棵二叉树T中只有一个带权为W i的根结点，其左右子树均空；b）在F中选取两棵根结点的权值最小的树作为左右子树构造一棵新的二叉树，且置新的二叉树的根结点的权值为其左、右子树上结点的权值之和；c）F中删除这两棵树，同时将新得到的二叉树加入F中； d）重复b)和c),直到F只含一棵树为止。
-Data Structure 1, Algorithm idea: Huffman tree algorithm: a) in accordance with a given value of n of the right (W1, W2 ..., Wn) constitute a set of n binary tree trees F = (T1, T2 ..., T n) , which for each binary tree T with only one right for the W i of the root node, its about subtree are empty b) in the F 2 in the root node of the right to select the smallest value of the tree as a subtree structure around a new binary tree, binary tree and the new home of the root node of the right value for the left and right sub-tree nodes and the right value c) F in the deletion of the two trees, at the same time obtained by adding a new binary tree F in d) repeat b) and c), until a tree F containing only so far.
Platform: |
Size: 28672 |
Author: Anson |
Hits:
Description: c语言编写的B+树，可实现树的构造和记录查找。-c language B+ tree, the tree structure can be achieved and records to find.
Platform: |
Size: 182272 |
Author: Y.A.M |
Hits:
Description: 红黑树的算法，网上有好多例子，包括移植STL中的RBTREE算法，但是我试了，不怎么好用阿。
这是麻省理工数据结构课程的一个实现，我把它改造了一下，经过30-40万的数据量测试 windows/unix下都做过测试，没有问题。-Red and black tree algorithm, the Internet has a lot of examples, including the transplantation of STL algorithms RBTREE, but I tried, not very easy to use the Arab-Israeli. This is the Massachusetts Institute of Technology, a data structure course realize, I modified it a bit, after 30-40 million the amount of data to test windows/unix done under test, no problem.
Platform: |
Size: 5120 |
Author: zhi |
Hits:
Description: 该程序的功能为已知二叉树中序遍历和后序遍历序列，求二叉树的二叉链表结构，程序中假设前序序列和中序序列已经分别储存在数组Pre和In中，由子树的前序和中序序列建立其二叉链表，在中序序列中查找子树根，计算左右子树的大小，置队列为空队列，输出左右孩子并入队列中-The functions of the program in order for the known binary tree traversal and postorder traversal sequence, and the binary tree structure list, the program assumes the former order sequence and sequences in the sequence has been stored in the array, respectively, Pre and In by sub-tree in the sequence before the sequence and the sequence of the establishment of second fork list, in order to find sub-sequences Shugen calculated about the size of subtree, home Queue queue is empty, the output about the children into the queue
Platform: |
Size: 1024 |
Author: ruikobe |
Hits:
Description: 构造二叉树的抽象数据类型
对于给定的先序序列和中序序列，构造二叉树，并按层输出所有结点内容，要求每层结点输出一行
按层输出上述二叉树所表示的森林的所有结点内容-Binary tree structure of the abstract data type for a given sequence of the first sequence and in order sequence, structure tree, and all the output layer node content, require each node output layer output by his party expressed the above-mentioned tree all forest node content
Platform: |
Size: 1024 |
Author: zt |
Hits:
Description: 树是一种很强大的数据结构，它的特点是每个节点最多只有一个前驱节点，有多个后继节点！-Tree is a very powerful data structure, it is characterized by a maximum of each node is only one pre-node, a number of follow-up node!
Platform: |
Size: 3072 |
Author: 灵朗 |
Hits:
Description: 此代码是字典树的实现源代码，字典树是一种数据结构，用它可以实现对各种单词的检索。而对每一个单词的查找次数是单词的长度。做acm题很有用，应用程序中相信也能优化很多算法！-This code is the dictionary tree realize the source code, the dictionary is a tree data structure, it can be achieved on a variety of word retrieval. And for each word is the number of search words in length. Acm title make useful applications, many believe that the optimization algorithm can be!
Platform: |
Size: 1024 |
Author: 孟繁荣 |
Hits:
Description: 网页上显示树状结构的javascript代码，可以分层实现迭起和展开。-Pages tree structure of javascript code, you can realize after another, and start layering.
Platform: |
Size: 26624 |
Author: zhf |
Hits:
Description: 网页上经常会用到的树状结构源代码,模拟文件夹方式,采用ajax方式动态加载数据,避免一次性加载带来的数据量过大的效率问题.-Pages are often used in the source code tree structure, simulating the way the folder, using the dynamic load data ajax way to avoid a one-time excessive load brought about by the efficiency of the data.
Platform: |
Size: 31744 |
Author: 赵培 |
Hits:
Description: 树控件（TREECTRL）的使用,用VC6.0的树控件（TREECTRL）建立树结构，包括树结构的建立，设置树结构的图标，和树结构的增加,删除，查看，排序等功能，是树控件TREECTRL）的使用入门资料。有详细说明文档一份和程序示例。-Tree Control (TREECTRL) the use of the tree with VC6.0 control (TREECTRL) the establishment of tree structure, including the establishment of tree structure, tree structure of the icon set, and the tree structure to add, delete, view, sort and other functions, is Tree Controls TREECTRL) the use of introductory information. Has detailed documentation and procedures for a sample.
Platform: |
Size: 47104 |
Author: lonfan |
Hits:
Description: tree结构，树形结构的实现，包括权限的设置-tree structure, tree structure realization, including permissions settings
Platform: |
Size: 15360 |
Author: 王亮 |
Hits:
Description: 本源码实现了树这个数据结构。可以直接拿来用-Realize the source of the data structure of the tree. Can be directly used by
Platform: |
Size: 10240 |
Author: hans |
Hits:
Description: 动态树型结构示例，可以参考参考，是jsp的，最原始的写法，没有用到框架之类的东西-Dynamic tree structure example, can refer to reference, is jsp, the most original formulation of the framework is not used and so on
Platform: |
Size: 5120 |
Author: 李锴 |
Hits:
Description: 用java写的几个数枝结构实例代码,希望给大家有所帮助-Using java to write a few examples of a few sticks of the structure of code, want to give you help
Platform: |
Size: 56320 |
Author: 黄悠之 |
Hits:
Description: 数据结构--树的代码。
参考和学习的上好资料。-Data Structure- tree code. Reference and learning of enclosed information.
Platform: |
Size: 3072 |
Author: 欧才俊 |
Hits:
« 12
3
4
5
6
7
8
9
10
...
50
»